﻿//https://www.nowcoder.com/practice/fcd30aac9c4f4028b23919a0c649824d?tpId=290&tqId=39833&ru=/exam/oj

//MY
#include <cmath>
#include <iostream>
#include <string>
using namespace std;


int num(long long n) {
    string str = to_string(n);
    string ret;
    for (auto st : str) {
        int x = st - '0';
        ret += (x % 2 == 0 ? '0' : '1');
    }
    return  stoi(ret);

}

int main() {
    long long n;

    cin >> n;
    cout << num(n) << endl;
    return 0;
}

//
#include <iostream>
#include <string>
using namespace std;
string s;
int main()
{
    cin >> s;
    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] % 2 == 0) s[i] = '0';
        else s[i] = '1';
    }
    cout << stoi(s) << endl; // ⾃动处理前导零
    return 0;
}


//https://ac.nowcoder.com/acm/problem/205836

//MY
#include <cstdio>
#include <cwchar>
#include <iostream>
using namespace std;

typedef long long LL;

int main() {
    int n, m;
    scanf("%ld%ld", &n, &m);
    LL a[n][m];
    LL rowsum[n];
    LL colsum[m];
    LL retsum[n][m];

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            scanf("%lld", &a[i][j]);

    for (int j = 0; j < m; j++) {
        colsum[j] = 0;
    }

    for (int i = 0; i < n; i++) {
        rowsum[i] = 0;
        for (int j = 0; j < m; j++) {
            rowsum[i] += a[i][j]; // 计算行和
            colsum[j] += a[i][j]; // 计算列和
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            retsum[i][j] = rowsum[i] + colsum[j] - a[i][j];

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cout << retsum[i][j] << ' ';
        }
        cout << endl;
    }
    return 0;
}

//
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
typedef long long LL;
LL n, m;
LL row[N], col[N];
int main()
{
    scanf("%ld %ld", &n, &m);
    LL arr[n][m];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            scanf("%ld", &arr[i][j]);
            row[i] += arr[i][j];
            col[j] += arr[i][j];
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            printf("%ld ", row[i] + col[j] - arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}



//https://ac.nowcoder.com/acm/problem/224679

// 滑动窗⼝
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
LL n, k;
LL h[N], s[N];
int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> h[i];
    for (int i = 1; i <= n; i++) cin >> s[i];
    LL left = 0, right = 0;
    LL hSum = 0, sSum = 0, hMax = 0, sMin = 0, begin = 0;
    while (right <= n)
    {
        hSum += h[right];
        sSum += s[right];
        while (right - left + 1 > k)
        {
            hSum -= h[left];
            sSum -= s[left];
            left++;
        }
        if (right - left + 1 == k)
        {
            if (hSum > hMax)
            {
                begin = left;
                hMax = hSum;
                sMin = sSum;
            }
            else if (hSum == hMax && sSum < sMin)
            {
                begin = left;
                hMax = hSum;
                sMin = sSum;
            }
        }
        right++;
    }
    cout << begin << endl;
    return 0;
}


               